Slice sampling in nested IBP

نویسنده

  • Jinsan Yang
چکیده

We develop a nonparametric Bayesian method that explores the infinite space of latent features and finds the best subset in the sense of posterior probability. When the data appear in several groups, there should be different measures reflecting the differences between the groups. We formalize this as a nested Indian buffet process (nIBP) by assuming different measures according to the specific types where corresponding set of groups belong to. For efficiently running the Gibbs sampling, slice sampling method is applied to our model with proper choice of stick components. Our contributions here are two fold. First we extended the Indian buffet process model by imposing nested structure above the groups of data sets and hence providing a hierarchically clustering method for objects having multiple features like images in nonparametric approach without imposing class numbers or feature numbers. We followed similar formulation as in nDP model except extending the IBP model instead of the DP model (Rodriguez, Dunson & Gelfand, 2008). Secondly in the computation of the stick breaking expressions, we applied the slice sampling method used in IBP model for properly expanding the stick components (Teh, Gorur & Ghahramani, 2007).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stick-breaking Construction for the Indian Buffet Process

The Indian buffet process (IBP) is a Bayesian nonparametric distribution whereby objects are modelled using an unbounded number of latent features. In this paper we derive a stick-breaking representation for the IBP. Based on this new representation, we develop slice samplers for the IBP that are efficient, easy to implement and are more generally applicable than the currently available Gibbs s...

متن کامل

The Infinite Factorial Hidden Markov Model

We introduce a new probability distribution over a potentially infinite number of binary Markov chains which we call the Markov Indian buffet process. This process extends the IBP to allow temporal dependencies in the hidden variables. We use this stochastic process to build a nonparametric extension of the factorial hidden Markov model. After constructing an inference scheme which combines sli...

متن کامل

Efficient Inference in the Infinite Multiple Membership Relational Model

The Indian Buffet Process (IBP) is a stochastic process on binary features that has been applied to modeling communities in complex networks [4, 5, 6]. Inference in the IBP is challenging as the potential number of possible configurations grows as 2 where K is the number of latent features and N the number of nodes in the network. We presently consider the performance of three MCMC sampling app...

متن کامل

Supplementary Material for Diachrony-aware Induction of Binary Latent Representations from Typological Features

In Bayesian statistics, the natural modeling choice for binary latent matrices is an Indian buffet process (IBP) (Griffiths and Ghahramani, 2011). In a preliminary study, we also modeled P (Z | A) using an IBP. However, we abandoned this approach for several reasons. The IBP is a stochastic process that can informally be seen as an extension of the Chinese restaurant process (CRP). While a CRP ...

متن کامل

Beam Search based MAP Estimates for the Indian Buffet Process

Nonparametric latent feature models offer a flexible way to discover the latent features underlying the data, without having to a priori specify their number. The Indian Buffet Process (IBP) is a popular example of such a model. Inference in IBP based models, however, remains a challenge. Sampling techniques such as MCMC can be computationally expensive and can take a long time to converge to t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011